A Versatile Model-Based Visibility Measure for Geometric Primitives
نویسندگان
چکیده
In this paper, we introduce a novel model-based visibility measure for geometric primitives called visibility map. It is simple to calculate, memory efficient, accurate for viewpoints outside the convex hull of the object and versatile in terms of possible applications. Several useful properties of visibility maps that show their superiority to existing visibility measures are derived. Various example applications from the automotive industry where the presented measure is used successfully conclude the paper.
منابع مشابه
Parleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملVis-Sort: Fast Visibility Ordering of 3-D Geometric Primitives
We present a novel sorting algorithm, Vis-Sort , to sort 1D and 3D geometric elements. Given a set of acyclic and non-intersecting 3D geometric primitives, Vis-Sort computes the visibility ordering from a viewpoint. The running time of our algorithm is dependent upon the degree of sortedness in the 3D sequence and is bounded by O(‖Y ‖n), where n is the number of primitives and ‖Y ‖ is the Knuth...
متن کاملClassification and properties of acyclic discrete phase-type distributions based on geometric and shifted geometric distributions
Acyclic phase-type distributions form a versatile model, serving as approximations to many probability distributions in various circumstances. They exhibit special properties and characteristics that usually make their applications attractive. Compared to acyclic continuous phase-type (ACPH) distributions, acyclic discrete phase-type (ADPH) distributions and their subclasses (ADPH family) have ...
متن کاملProbabilistic visibility evaluation using geometry proxies
Evaluating the visibility between two points is a fundamental problem for ray-tracing and path-tracing algorithms. Ideally, visibility computations are organized such that a minimum number of geometric primitives need to be checked for each ray. Replacing complex geometric shapes by a simpler set of primitives is one strategy to control the amount of intersection calculations. However, approxim...
متن کاملFast Geometric Sound Propagation with Finite-Edge Diffraction
We present a fast algorithm to perform sound propagation in complex 3D scenes. Our approach computes propagation paths from each source to the listener by taking into account specular reflections and higher-order edge diffractions around finite edges in the scene. We use the well known Biot-Tolstoy-Medwin diffraction model along with efficient algorithms for region-based visibility to cull away...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005